A Decision Procedure for Well - Formed Lqcas
نویسنده
چکیده
In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to deene the probability of a connguration in an observation as the squared magnitude of its amplitude. We give an eecient algorithm which decides if a linear quantum cellular automaton is well-formed. The complexity of the algorithm is O(n 2) in the algebraic model of computation if the input automaton has continuous neighborhood.
منابع مشابه
Combining data envelopment analysis and multi-objective model for the efficient facility location–allocation decision
This paper proposes an innovative procedure of finding efficient facility location–allocation (FLA) schemes, integrating data envelopment analysis (DEA) and a multi-objective programming (MOP) model methodology. FLA decisions provide a basic foundation for designing efficient supply chain network in many practical applications. The procedure proposed in this paper would be applied to the FLA pr...
متن کاملMathematical solution of multilevel fractional programming problem with fuzzy goal programming approach
In this paper, we show a procedure for solving multilevel fractional programming problems in a large hierarchical decentralized organization using fuzzy goal programming approach. In the proposed method, the tolerance membership functions for the fuzzily described numerator and denominator part of the objective functions of all levels as well as the control vectors of the higher level decision ...
متن کاملImproved Profitability and Competition in Two Level Supply Chain by Non-Cooperative Games
This article by modeling a non-cooperative dynamic game tries to improve profitability and competition. This paper has considered how the manufacturer interacts with multiple competitor distributors. Each distributor also determines the optimal distribution price and inventory replenishment policies to maximize their profits. The issue form a non-cooperative dynamic game. Distributors formulate...
متن کاملA goal programming procedure for ranking decision making units in DEA
This research proposes a methodology for ranking decision making units byusing a goal programming model.We suggest a two phases procedure. In phase1, by using some DEA problems for each pair of units, we construct a pairwisecomparison matrix. Then this matrix is utilized to rank the units via the goalprogramming model.
متن کاملA Decision Procedure for Well-Formed Linear Quantum Cellular Automata
In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to define the probability of a configuration in an observation as the squared magnitude of its amplitude. We give an efficient algorithm which decides if a linear quantum cellular automaton is well-formed...
متن کامل